Service Guarantees for Joint Scheduling and Flow Control
نویسندگان
چکیده
We consider a general mesh network with multiple traf-c streams subject to window ow control on a per hop, per stream basis. Scheduling at each server is governed by \service curve" requirements. We establish lower bounds on the window sizes such that each stream receives pre-speciied service guarantees.
منابع مشابه
A Per-VC Global FIFO Scheduling Algorithm for Implementing the New ATM GFR Service
The performance of various GFR (Guaranteed Frame Rate) implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. In this paper we describe and evaluate a scheduling algorithm to provide the GFR service guarantees. The evaluation is performed by simulation using TCP connections. The proposed scheduling is...
متن کاملImplementation Issues to Provide the GFR Service Guarantees to TCP / IP Traffic
The performance of various GFR (Guaranteed Frame Rate) implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. In this paper we describe and evaluate a scheduling algorithm to provide the GFR service guarantees. The evaluation is performed by simulation using TCP connections. The proposed scheduling is...
متن کاملQuantifiable Service Differentiation for Packet Networks
In this dissertation, we present a novel service architecture for the Internet, which reconciles application demand for strong service guarantees with the need for low computational overhead in network routers. The main contribution of this dissertation is the definition and realization of a new service, called Quantitative Assured Forwarding, which can offer absolute and relative differentiati...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کاملA Programmable Switch Architecture For Achieving Flexible Quality Of Service
This paper describes a programmable switch architecture that can be dynamically tuned to support flexible quality of service metrics for flows in the Internet. The switch architecture consists of six key components: scheduling, flow aggregation, queueing, packet-level admission control, packet dropping, and feedback. We show that it is possible to achieve a wide range of QoS behavior ranging fr...
متن کامل